Dynamic Compositional Neural Networks over Tree Structure

نویسندگان

  • Pengfei Liu
  • Xipeng Qiu
  • Xuanjing Huang
چکیده

Tree-structured neural networks have proven to be effective in learning semantic representations by exploiting syntactic information. In spite of their success, most existing models suffer from the underfitting problem: they recursively use the same shared compositional function throughout the whole compositional process and lack expressive power due to inability to capture the richness of compositionality. In this paper, we address this issue by introducing the dynamic compositional neural networks over tree structure (DC-TreeNN), in which the compositional function is dynamically generated by a meta network. The role of metanetwork is to capture the metaknowledge across the different compositional rules and formulate them. Experimental results on two typical tasks show the effectiveness of the proposed models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identification of Crack Location and Depth in a Structure by GMDH- type Neural Networks and ANFIS

The Existence of crack in a structure leads to local flexibility and changes  the stiffness and dynamic behavior of the structure. The dynamic behavior of the cracked structure depends on the depth and the location of the crack. Hence, the changes in the dynamic behavior in the structure due to the crack can be used for identifying the location and depth of the crack. In this study the first th...

متن کامل

Tree-Structured Composition in Neural Networks without Tree-Structured Architectures

Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models like LSTMs are in fact able to discover and implicitly use recursive compositional structure, at least for tasks with clear cues to that structure in the dat...

متن کامل

A Comparative Study of two Self Organising and Structurally Adaptive Dynamic Neural Tree Networks

This paper examines the performance of Dynamic Neural Tree Networks (DNTNs) which perform hierarchical clustering on unlabelled data. DNTNs are a form of competitive learning neural networks where the competitive neurons are created dynamically, forming a tree configuration which represents the structure inherent in the data set. Two such models have been produced independently by Racz and Klot...

متن کامل

Compositional Generative Mapping for Tree-Structured Data - Part II: Topographic Projection Model

We introduce GTM-SD (Generative Topographic Mapping for Structured Data), which is the first compositional generative model for topographic mapping of tree-structured data. GTM-SD exploits a scalable bottom-up hidden-tree Markov model that was introduced in Part I of this paper to achieve a recursive topographic mapping of hierarchical information. The proposed model allows efficient exploitati...

متن کامل

Joint RNN-Based Greedy Parsing and Word Composition

This paper introduces a greedy parser based on neural networks, which leverages a new compositional sub-tree representation. The greedy parser and the compositional procedure are jointly trained, and tightly depends on each-other. The composition procedure outputs a vector representation which summarizes syntactically (parsing tags) and semantically (words) sub-trees. Composition and tagging is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017